Quantum Kronecker sum-product low-density parity-check codes with finite rate

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence of Sum-Product Algorithm for Finite Length Low-Density Parity-Check Codes

The convergence behavior of an iterative decoder for low-density parity-check codes is investigated. The influence of finite length codes containing cycles in the factor graph is considered and different types of decoding errors are identified and classified.

متن کامل

Low Density Parity Check Codes

Low Density Parity Check Codes originally invented by Gallagher and subsequently rediscovered by multiple groups 30 years later has become the best known error correcting code in a variety of situations. In this paper, we review regular and irregular LDPC codes. We describe a number of message passing decoders for decoding these codes and explain their operation via examples. Density evolution,...

متن کامل

Low-density parity-check codes

A low-density parity-check code is a code specified by a parity-check matrix with the following properties : each column contains a small fixed numberj > 3 of I’s and each row contains a small fixed number k > j of 1’s. The typical minimum distance of these codes increases linearly with block length for a fixed rate and fixed j. When used with maximum likelihood decoding on a snfhciently quiet ...

متن کامل

Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation

Density evolution is an algorithm for computing the capacity of low-density parity-check (LDPC) codes under messagepassing decoding. For memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels and sum-product decoders, we use a Gaussian approximation for message densities under density evolution to simplify the analysis of the decoding algorithm. We convert the i...

متن کامل

Gaussian Approximation for Sum-Product Decoding of Low-Density Parity-Check Codes

We use a Gaussian approximation (GA) for analyzing the sum-product algorithm for lowdensity parity-check (LDPC) codes and memoryless binary-input continuous-output additive white Gaussian noise (AWGN) channels. This simplification allows us to calculate the threshold quickly and to understand the behavior of the decoder better. We have also designed high rate LDPC codes using the GA that have t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review A

سال: 2013

ISSN: 1050-2947,1094-1622

DOI: 10.1103/physreva.88.012311